Pivot Selection Method for Optimizing both Pruning and Balancing in Metric Space Indexes.

A Variational Bayesian EM Algorithm for Tree Similarity.


Language Model Combination for Community%2Dbased Q %26 A Retrieval.


Approximating Tree Edit Distance through String Edit Distance.

Margin%2DBased Pivot Selection for Similarity Search Indexes.

Hybrid Recommender System Using Latent Features.

Bag of Timestamps A Simple and Efficient Bayesian Chronological Mining.

Dynamic hyperparameter optimization for bayesian topical trend analysis.

Maximal metric margin partitioning for similarity search indexes.

A Versatile Record Linkage Method by Term Matching Model Using CRF.

Latent Topic Extraction from Relational Table for Record Matching.

Bayesian Similarity Model Estimation for Approximate Recognized Text Search.

Using Web Resources for Support of Online%2Dbrowsing of Research Papers.

Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees.

Load Balancing Scheme on the Basis of Huffman Coding for P2P Information Retrieval.

Bibliographic element extraction from scanned documents using conditional random fields.

Information Extraction by Two Dimensional Parser.

Crf%2Dbased authors%27 name tagging for scanned documents.

Two%2DPhased Active Support Kernel Machine Learning.

Information extraction from scanned documents by stochastic page layout analysis.

Huffman%2DDHT Index Structure Refinement Scheme for P2P Information Retrieval.

Name Disambiguation Boosted by Latent Topics from Web Directories.

Improved approximation of the largest common subtree of two unordered trees of bounded height.

Improving the performance of personal name disambiguation using web directories.

Using Web Directories for Similarity Measurement in Personal Name Disambiguation.

Authors%27 names extraction from scanned documents.

Statistical Learning Algorithm for Tree Similarity.

Support Kernel Machine%2DBased Active Learning to Find Labels and a Proper Kernel Simultaneously.

A Smoothing Method for a Statistical String Similarity.

Citation data clustering for author name disambiguation.

UpdateNews a news clustering and summarization system using efficient text processing.

Query Refinement based on Topical Term Clustering.

Disambiguation of People in Web Search Using a Knowledge Base.

Using a knowledge base to disambiguate personal name in web search results.

Data allocation scheme based on term weight for P2P information retrieval.
Many Peer-to-Peer information retrieval systems that use a global index have already been proposed that can retrieve documents relevant to a query. Since documents are allocated to peers regardless of the query, the system needs to connect many peers to gather the relevant documents. We propose a new data allocation scheme for P2P information retrieval that we call Concordia. Concordia uses a node to allocate a document based on the weight of each term in the document to efficiently assemble all the documents relevant to a query from the P2P Network. Moreover, the node encodes the binary data of a document with an erasure code, and Concordia produces an efficient redundancy for counteracting node failures.
Quality enhancement in information extraction from scanned documents.

An approximate multi%2Dword matching algorithm for robust document retrieval.

An approximate multi%2Dword matching algorithm for robust document retrieval.

An Annotation Method for Sensor Data Streams based on Statistical Patterns.

A New Measure for Query Disambiguation Using Term Co%2Doccurrences.

Approximating Tree Edit Distance Through String Edit Distance.

A Platform for Managing Term Dictionaries for Utilizing Distributed Interview Archives.

Effect of relationships between words on Japanese information retrieval.

A Topic%2Dbased Index Mechanism using Usefulness of Peers in Unstructured Peer%2Dto%2DPeer Networks.

An Effective Access Mechanism to Digital Interview Archives.

A Sequence Labeling Method Using Syntactical and Textual Patterns for Record Linkage.

Adaptive Replication Method Based on Peer Behavior Pattern in Unstructured Peer%2Dto%2DPeer Systems.


Analyzing Relations among Software Patterns based on Document Similarity.

A reciprocal platform for archiving interview videos about arts and crafts.


Bibliographic component extraction from references based on a text recognition error model.

Web Page Grouping Based on Parameterized Connectivity.

An Index System for Dynamic Peer%2Dto%2DPeer Network Based on Document Usefulness.

Improving the Relevance%2Dbased Superimposition model for IR with automatic keyword extraction.
Our previous studies proved that our proposed Relevance-based Superimposition (RS) model for information retrieval (IR) is very effective for scientific paper archives where the expressional variation between documents written by different authors is high. The RS model makes the best use of the relevance of documents by modifying document feature vectors based on the relevance information.
Bibliographic Component Extraction Using Support Vector Machines and Hidden Markov Models.

Feature Word Tracking in Time Series Documents..

Improving the Relevance%2Dbased Superimposition model for IR with automatic keyword extraction.
Our previous studies proved that our proposed Relevance-based Superimposition (RS) model for information retrieval (IR) is very effective for scientific paper archives where the expressional variation between documents written by different authors is high. The RS model makes the best use of the relevance of documents by modifying document feature vectors based on the relevance information.
A Statistical Model for Flexible String Similarity.

Bibliographic Attribute Extraction from Erroneous References Based on a Statistical Model.

Information Extraction from HTML Pages and its Integration.

Statistical Analysis of Bibliographic Strings for Constructing an Integrated Document Space.

DVHMM Variable Length Text Recognition Error Model.

Statistical phrase extraction and indexing for music retrieval.

Classification of Object Sequences Using Syntactical Structure.

The Effects of the Relevance%2DBased Superimposition Model in Cross%2DLanguage Information Retrieval.

Document Filtering for Fast Approximate String Matching of Errorneous Text.

Category Based Customization Approach for Information Retrieval.

Probabilistic Automaton Model for Fuzzy English%2DText Retrieval.

Effect of dependency relationships and ordered co%2Doccurrence of words on Japanese information retrival %28poster session%29.

The Effect of Information Retrieval Method Using Dependency Relationship Between Words.
It is difficult to improve retrieval effectiveness by using only keyword-based retrieval due to its high dependence on statistical word distributions. We propose a method that enhances retrieval effectiveness using dependency relationships between words in sentences of documents and queries. In our method, we create a Structured Index,  represented by a binary tree, in three steps. These steps are morphological analysis, dependency analysis based on a title template, and compound nouns analysis based on word bigram statistics. In the retrieval phase, a query is structured in the form of a binary tree by the same process as indexing and is compared with a Structured Index by shrinking binary trees according to the rules of dependency relationships of Japanese. We also define the similarity between a binary tree of a query and a set of binary trees of a document. From retrieval experiments with NTCIR--1, which is a large-scale Japanese test collection for information retrieval, we show t...
Variance based classifier comparison in text categorization.

Reduction of expanded search terms for fuzzy English%2Dtext retrieval.

Music Structure Analysis and Its Application to Theme Phrase Extraction.

On the Number of Clusters in Cluster Analysis.
 A unified learning framework is proposed. Its different special cases will automatically lead us to current existing major types of neural network learnings, e.g, data clustering, various PCA-type self-organizations and their localized extensions, self-organizing topological map, as well as supervised learning for feedforward network and modular architecture. Not only this new framework is useful for a deep understanding of the existing learnings, but also it provides new insights that can guide the extensions of the existing learning methods. With the new insights, we have obtained several new intersting unsupervised learnings, and introduced regularization or generalization to unsupervised learnings, particularly proposed approaches for solving a classical hard problem -- how to decide the number of clusters in clustering analysis or competitive learning.
Reduction of Expanded Search Terms for Fuzzy English%2DText Retrieval.

A System for Constructing Private Digital Libraries Through Information Space Exploration.

Bibliographic Integration in Digital Document Libraries %28Poster%29.

A System for Exploring Information Spaces.

Retrieval methods for English%2Dtext with missrecognized OCR characters.
This paper presents three probabilistic text retrieval methods designed to carry out a full-text search of English documents containing OCR errors. By searching for any query term on the premise that there are errors in the recognized text, the methods presented can tolerate such errors, and therefore costly manual postediting is not required after OCR recognition. In the applied approach, confusion matrices are used to store characters which are likely to be interchanged when a particular character is missrecognized, and the respective probability of each occurrence. Moreover, a 2-gram matrix is used to store probabilities of character connection, i.e., which letter is likely to come after another. Multiple search terms are generated for an input query term by making reference to confusion matrices, after which a full-text search is run for each search term. The validity of retrieved terms is determined based on error-occurrence and characterconnection probabilities. The performance o...
An Approximate String Match for Garbled Text with Various Accuracy.

COSPEX A System for Constructing Private Digital Libraries.
In this paper we describe a system called COSPEX (COnceptual SPace EXplorer) which aims at assisting users in constructing their own private digital libraries. Information servers on the Internet have their own purposes. Each of the servers is constructed distributedly and managed autonomously, and its semantics is different from each other. On the other hand, users&#039; information needs are different from each other. Now that almost infinite information resources are accessible through the Internet, a new method for promoting the mediation between the semantics of information servers and users&#039; information needs is inevitable for users to fully utilize these information resources. COSPEX is a system which can enhance such mediation. When users of COSPEX access a certain information server, its database schema is loaded and visualized on the user interface. Users can interactively construct their own queries by viewing the visualized database schema. COSPEX can also assist users in their ...
A Query Processing Method for Integrated Access to Multiple Databases.

Sampling Effectiveness in Discovering Functional Relationships in Databases.

An automated generation of an electronic library based on document image understanding.

A rule learning method for academic document image processing.

A Rule Discovery Method Based on Approximate Dependency Inference.

On PAC Learnability of Functional Depencies.

On PAC Learnability of Functional Dependencies.

A Syntactical Approach to the Database Construction Method from Document Images.

Intelligent Wing Design Support System.

